全文获取类型
收费全文 | 124126篇 |
免费 | 3440篇 |
国内免费 | 442篇 |
专业分类
电工技术 | 1027篇 |
综合类 | 2348篇 |
化学工业 | 18820篇 |
金属工艺 | 5470篇 |
机械仪表 | 3824篇 |
建筑科学 | 3446篇 |
矿业工程 | 633篇 |
能源动力 | 1926篇 |
轻工业 | 8917篇 |
水利工程 | 1602篇 |
石油天然气 | 511篇 |
武器工业 | 4篇 |
无线电 | 11470篇 |
一般工业技术 | 23337篇 |
冶金工业 | 14150篇 |
原子能技术 | 472篇 |
自动化技术 | 30051篇 |
出版年
2023年 | 366篇 |
2022年 | 348篇 |
2021年 | 916篇 |
2020年 | 788篇 |
2019年 | 718篇 |
2018年 | 15526篇 |
2017年 | 14496篇 |
2016年 | 11196篇 |
2015年 | 1754篇 |
2014年 | 1685篇 |
2013年 | 3098篇 |
2012年 | 5518篇 |
2011年 | 11359篇 |
2010年 | 9826篇 |
2009年 | 6967篇 |
2008年 | 8423篇 |
2007年 | 9140篇 |
2006年 | 1365篇 |
2005年 | 2238篇 |
2004年 | 2099篇 |
2003年 | 2005篇 |
2002年 | 1289篇 |
2001年 | 605篇 |
2000年 | 700篇 |
1999年 | 716篇 |
1998年 | 3791篇 |
1997年 | 2257篇 |
1996年 | 1486篇 |
1995年 | 844篇 |
1994年 | 746篇 |
1993年 | 726篇 |
1992年 | 238篇 |
1991年 | 276篇 |
1990年 | 238篇 |
1989年 | 241篇 |
1988年 | 223篇 |
1987年 | 186篇 |
1986年 | 193篇 |
1985年 | 240篇 |
1984年 | 198篇 |
1983年 | 145篇 |
1982年 | 190篇 |
1981年 | 198篇 |
1980年 | 170篇 |
1979年 | 135篇 |
1978年 | 133篇 |
1977年 | 227篇 |
1976年 | 451篇 |
1975年 | 99篇 |
1973年 | 93篇 |
排序方式: 共有10000条查询结果,搜索用时 250 毫秒
991.
R. Caballero-Águila A. Hermoso-Carazo J. Linares-Pérez 《Digital Signal Processing》2012,22(6):1118-1125
The least-squares linear estimation problem (including prediction, filtering and fixed-point smoothing) from measurements transmitted by different sensors subject to random packet dropouts is addressed. For each sensor, a different Bernoulli sequence is used to model the packet dropout process. Under the assumption that the signal evolution model is unknown, recursive estimation algorithms are derived by an innovation approach, requiring only information about the covariances of the processes involved in the observation equation, as well as the knowledge of the dropout probabilities at each sensor. 相似文献
992.
Marcelo Arenas Jorge Pérez Juan Reutter Cristian Riveros 《The VLDB Journal The International Journal on Very Large Data Bases》2012,21(6):823-842
The inversion of schema mappings has been identified as one of the fundamental operators for the development of a general framework for metadata management. During the last few years, three alternative notions of inversion for schema mappings have been proposed (Fagin-inverse (Fagin, TODS 32(4), 25:1–25:53, 2007), quasi-inverse (Fagin et?al., TODS 33(2), 11:1–11:52, 2008), and maximum recovery (Arenas et?al., TODS 34(4), 22:1–22:48, 2009)). However, these notions lack some fundamental properties that limit their practical applicability: most of them are expressed in languages including features that are difficult to use in practice, some of these inverses are not guaranteed to exist for mappings specified with source-to-target tuple-generating dependencies (st-tgds), and it has been futile to search for a meaningful mapping language that is closed under any of these notions of inverse. In this paper, we develop a framework for the inversion of schema mappings that fulfills all of the above requirements. It is based on the notion of ${\mathcal{C}}$ -maximum recovery, for a query language ${\mathcal{C}}$ , a notion designed to generate inverse mappings that recover back only the information that can be retrieved with queries in ${\mathcal{C}}$ . By focusing on the language of conjunctive queries (CQ), we are able to find a mapping language that contains the class of st-tgds, is closed under CQ-maximum recovery, and for which the chase procedure can be used to exchange data efficiently. Furthermore, we show that our choices of inverse notion and mapping language are optimal, in the sense that choosing a more expressive inverse operator or mapping language causes the loss of these properties. 相似文献
993.
Lasserre S Hernando J Hill S Schümann F Anasagasti Pde M Jaoudé GA Markram H 《IEEE transactions on visualization and computer graphics》2012,18(2):214-227
We present a process to automatically generate three-dimensional mesh representations of the complex, arborized cell membrane surface of cortical neurons (the principal information processing cells of the brain) from nonuniform morphological measurements. Starting from manually sampled morphological points (3D points and diameters) from neurons in a brain slice preparation, we construct a polygonal mesh representation that realistically represents the continuous membrane surface, closely matching the original experimental data. A mapping between the original morphological points and the newly generated mesh enables simulations of electrophysiolgical activity to be visualized on this new membrane representation. We compare the new mesh representation with the state of the art and present a series of use cases and applications of this technique to visualize simulations of single neurons and networks of multiple neurons. 相似文献
994.
O'Reilly C Plamondon R 《IEEE transactions on systems, man, and cybernetics. Part B, Cybernetics》2012,42(5):1428-1442
Fast reaching movements are an important component of our daily interaction with the world and are consequently under investigation in many fields of science and engineering. Today, useful models are available for such studies, with tools for solving the inverse dynamics problem involved by these analyses. These tools generally provide a set of model parameters that allows an accurate and locally optimal reconstruction of the original movements. Although the solutions that they generate may provide a data curve fitting that is sufficient for some pattern recognition applications, the best possible solution is often necessary in others, particularly those involving neuroscience and biomedical signal processing. To generate these solutions, we present a globally optimal parameter extractor for the delta-lognormal modeling of reaching movements based on the branch-and-bound strategy. This algorithm is used to test the impact of white noise on the delta-lognormal modeling of reaching movements and to benchmark the state-of-the-art locally optimal algorithm. Our study shows that, even with globally optimal solutions, parameter averaging is important for obtaining reliable figures. It concludes that physiologically derived rules are necessary, in addition to global optimality, to achieve meaningful ?Λ extractions which can be used to investigate the control patterns of these movement primitives. 相似文献
995.
del Campo I Basterretxea K Echanobe J Bosque G Doctor F 《IEEE transactions on systems, man, and cybernetics. Part B, Cybernetics》2012,42(2):501-512
This paper presents the development of a neuro-fuzzy agent for ambient-intelligence environments. The agent has been implemented as a system-on-chip (SoC) on a reconfigurable device, i.e., a field-programmable gate array. It is a hardware/software (HW/SW) architecture developed around a MicroBlaze processor (SW partition) and a set of parallel intellectual property cores for neuro-fuzzy modeling (HW partition). The SoC is an autonomous electronic device able to perform real-time control of the environment in a personalized and adaptive way, anticipating the desires and needs of its inhabitants. The scheme used to model the intelligent agent is a particular class of an adaptive neuro-fuzzy inference system with piecewise multilinear behavior. The main characteristics of our model are computational efficiency, scalability, and universal approximation capability. Several online experiments have been performed with data obtained in a real ubiquitous computing environment test bed. Results obtained show that the SoC is able to provide high-performance control and adaptation in a life-long mode while retaining the modeling capabilities of similar agent-based approaches implemented on larger computing machines. 相似文献
996.
In this paper, we present an efficient way of implementing OpenGL ES 1.1 3D graphics API library for the environments with
hardware-supported OpenGL facility, typically as desktop PCs. Although OpenGL ES was started from the existing OpenGL features,
it rapidly became the standard 3D graphics library customized for embedded systems through introducing fixed-point arithmetic
operations, buffer management with fixed-point data type supports, completely new texture mapping functions and others. Currently,
it is the official 3D graphics API for Google Android, Apple iPhone, Sony PlayStation3, etc. In this paper, we achieved improvements
on the arithmetic operations for the fixed-point number representation, which is the most characteristic data type for OpenGL
ES 1.1. For the conversion of fixed-point data types to the floating-point number representations for the underlying OpenGL,
we show the way of efficient conversion processes even with satisfying OpenGL ES standard requirements. We also introduced
a specialized memory management scheme to manage the converted data from the buffer containing fixed-point numbers. In the
case of texture processing, the requirements in both standards are quite different, and thus we used completely new software-implementations.
Our final implementation of OpenGL ES library provides all of more than 200 functions in the standard specification and passed
its conformance test, to show its compliance with the standard. From the efficiency point of view, we measured its execution
times for several OpenGL ES-specific application programs and achieved remarkable improvements. 相似文献
997.
In this paper, we present AutoMed, an automated mediator for multi-issue bilateral negotiation under time constraints. AutoMed
elicits the negotiators preferences and analyzes them. It monitors the negotiations and proposes possible solutions for resolving
the conflict. We conducted experiments in a simulated environment. The results show that negotiations mediated by AutoMed
are concluded significantly faster than non-mediated ones and without any of the negotiators opting out. Furthermore, the
subjects in the mediated negotiations are more satisfied with the resolutions than the subjects in the non-mediated negotiations. 相似文献
998.
In this paper, we present a formulation of the quaternion constraint for rigid body rotations in the form of a standard perfect
bilateral mechanical constraint, for which the associated Lagrangian multiplier has the meaning of a constraint force. First,
the equations of motion of a scalable body are derived. A scalable body has three translational, three rotational, and one
uniform scaling degree of freedom. As generalized coordinates, an unconstrained quaternion and a displacement vector are used.
To the scalable body, a perfect bilateral constraint is added, restricting the quaternion to unit length and making the body
rigid. This way a quaternion based differential algebraic equation (DAE) formulation for the dynamics of a rigid body is obtained,
where the 7×7 mass matrix is regular and the unit length restriction of the quaternion is enforced by a mechanical constraint.
Finally, the equations of motion in the form of a DAE are linked to the Newton–Euler equations of motion of a rigid body.
The rigid body DAE formulation is useful for the construction of (energy) consistent integrators. 相似文献
999.
Monique Jackson Ines Benkhemis Micka?l Begon Philippe Sardain Claude Vallée Patrick Lacouture 《Multibody System Dynamics》2012,28(3):225-237
Optimal synthesis of human movement or the prediction of the kinematics of a new movement require not only that the multi-body system be modeled but also that a performance criterion is specified. For sub-maximal movements the selection of a suitable performance criterion, able to generate realistic dynamic behavior is difficult. A two-dimensional simulation model of the take-off phase of a sub-maximal long jump was developed to study the effect of criterion choice on the realism of simulated movements. A parametric optimization technique was employed to obtain solutions to the constrained equations of motion. Seven different criteria were evaluated, by comparing simulated movements with an actual performance, to identify the criterion which most closely approximated that spontaneously minimized by the athlete. Synthesis of the take-off phase of a sub-maximal long jump was found to be sensitive to the chosen criterion, with a criterion based on minimizing joint intersegmental forces found to perform well. 相似文献
1000.
Bettina Berendt 《Data mining and knowledge discovery》2012,24(3):697-737
Over the last decade, privacy has been widely recognised as one of the major problems of data collections in general and the
Web in particular. This concerns specifically data arising from Web usage (such as querying or transacting) and social networking
(characterised by rich self-profiling including relational information) and the inferences drawn from them. The data mining
community has been very conscious of these issues and has addressed in particular the inference problems through various methods
for “privacy-preserving data mining” and “privacy-preserving data publishing”. However, it appears that these approaches by
themselves cannot effectively solve the privacy problems posed by mining. We argue that this is due to the underlying notions
of privacy and of data mining, both of which are too narrow. Drawing on notions of privacy not only as hiding, but as control
and negotiation, as well as on data mining not only as modelling, but as the whole cycle of knowledge discovery, we offer
an alternative view. This is intended to be a comprehensive view of the privacy challenges as well as solution approaches
along all phases of the knowledge discovery cycle. The paper thus combines a survey with an outline of an agenda for a comprehensive,
interdisciplinary view of Web mining and privacy. 相似文献